Unusual class of polynomials related to partitions
نویسندگان
چکیده
Abstract In this paper, we study, for a given arithmetic function f , the sequence of polynomials $$(P_{n}^{f}(t))_{n=0}^{\infty }$$ ( P n f t ) = 0 ∞ defined by recurrence $$\begin{aligned} \left\{ \begin{array}{ll} P_{0}^{f}(x)=1, &{} \\ P_{1}^{f}(x)=x, P_{n}^{f}(x)=\frac{x}{n}\sum _{k=1}^{n}f(k)P_{n-k}^{f}(x), n\ge 2. \end{array}\right. \end{aligned}$$ x 1 , ∑ k - ≥ 2 . Using ideas from paper Heim, Luca, and Neuhauser, prove, under some assumptions on $$P_{n}^{f}(t)$$ $$1\le n\le 10$$ ≤ 10 that no root unity can be any polynomial $$n\in {\mathbb {N}}$$ ∈ N . Then specify result to functions related colored partitions.
منابع مشابه
On a class of polynomials related to Barker sequences
For an odd integer n > 0, we introduce the class LPn of Laurent polynomials P (z) = (n+ 1) + n ∑ k=1 k odd ck(z k + z−k), with all coefficients ck equal to −1 or 1. Such polynomials arise in the study of Barker sequences of even length, i.e., integer sequences having minimal possible autocorrelations. We prove that polynomials P ∈ LPn have large Mahler measures, namely, M(P ) > (n + 1)/2. We co...
متن کاملA class of permutation polynomials of F2m related to Dickson polynomials
We construct a class of permutation polynomials of F2m that are closely related to Dickson polynomials.
متن کاملMeixner Polynomials and Random Partitions
The paper deals with a 3-parameter family of probability measures on the set of partitions, called the z-measures. The z-measures first emerged in connection with the problem of harmonic analysis on the infinite symmetric group. They are a special and distinguished case of Okounkov’s Schur measures. It is known that any Schur measure determines a determinantal point process on the 1-dimensional...
متن کاملPolynomials Related to Generalized Chebyshev Polynomials
We study several classes of polynomials, which are related to the Chebyshev, Morgan-Voyce, Horadam and Jacobsthal polynomials. Thus, we unify some of well-known results.
متن کاملPartitions, Kostka Polynomials and Pairs of Trees
Bennett et al. [2] presented a recursive algorithm to create a family of partitions from one or several partitions. They were mainly interested in the cases when we begin with a single square partition or with several partitions with only one part. The cardinalities of those families of partitions are the Catalan and ballot numbers, respectively. In this paper we present a non-recursive descrip...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Ramanujan Journal
سال: 2023
ISSN: ['1572-9303', '1382-4090']
DOI: https://doi.org/10.1007/s11139-023-00739-9